Capacitated Vehicle Routing Problem Under Deadlines: An Application to Flooding Crisis
نویسندگان
چکیده
Facing the issue of flash floods and their important damage both to victims infrastructures, involved authorities are interested in study ways answer at best this kind crisis long-term emergency phase. The victim relief operations can be optimized help rescue teams improve management situation. It is translated into field by development a decision support tool for operations. problem addressed Vehicle Routing Problem (VRP) vehicles. This article focuses on searching efficient algorithms terms execution time intervention promptness solve VRPs. Data from past used paper evaluate performances problems as close experience possible. Since need divide forces different impacted sectors during flooding, dispatch resources (rescue team’s vehicles) between areas studied.
منابع مشابه
The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
We study the robust capacitated vehicle routing problem (CVRP) under demand uncertainty, which determines a minimum cost delivery of a product to geographically dispersed customers using capacity-constrained vehicles. Contrary to the deterministic CVRP, which postulates that the customer demands for the product are deterministic and known, the robust CVRP models the customer demands as random v...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملOn the capacitated vehicle routing problem
We consider the Vehicle Routing Problem, in which a fixed fleet of delivery vehicles of uniform capacity must service known customer demands for a single commodity from a common depot at minimum transit cost. This difficult combinatorial problem contains both the Bin Packing Problem and the Traveling Salesman Problem (TSP) as special cases and conceptually lies at the intersection of these two ...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملThe pyramidal capacitated vehicle routing problem
This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the Pyramidal Traveling Salesman Problem (PTSP). A pyramidal route is defined as a route on which the vehicle first visits customers in increasing order of custom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2022
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2022.3170446